An intermodal multicommodity routing problem with scheduled services
نویسندگان
چکیده
منابع مشابه
An intermodal multicommodity routing problem with scheduled services
We study a multicommodity routing problem faced by an intermodal service operator that uses ground and maritime transportation. Given a planning horizon, a set of commodities to be picked up at their release times and to be delivered not later than their duedates, the problem is to decide on routes for these commodities using trucks and scheduled and capacitated maritime services at minimum cos...
متن کاملMultimodal Multicommodity Routing Problem with Scheduled Services
MULTIMODAL MULTICOMMODITY ROUTING PROBLEM WITH SCHEDULED SERVICES Burak Ayar M.S. in Industrial Engineering Supervisor: Assist. Prof. Dr. Hande Yaman November, 2008 We study a multicommodity network flow problem faced by a third party logistics company that has the possibility of using ground and maritime transportation. We are given a set of commodities which should be picked up from their ori...
متن کاملOn Solving the Fuzzy Customer Information Problem in Multicommodity Multimodal Routing with Schedule-Based Services
Abstract: In this study, we combine the fuzzy customer information problem with the multicommodity multimodal routing with schedule-based services which was explored in our previous study [1]. The fuzzy characteristics of the customer information are embodied in the demanded volumes of the multiple commodities and the time windows of their due dates. When the schedule-based services are conside...
متن کاملOnline Multicommodity Routing with Time Windows Tobias
We consider a multicommodity routing problem, where demands are released online and have to be routed in a network during specified time windows. The objective is to minimize a time and load dependent convex cost function of the aggregate arc flow. First, we study the fractional routing variant. We present two online algorithms, called Seq and Seq. Our first main result states that, for cost fu...
متن کاملCompetitive Online Multicommodity Routing Tobias
In this paper we study online multicommodity routing problems in networks, in which commodities have to be routed sequentially. The flow of each commodity can be split on several paths. Arcs are equipped with load dependent price functions defining routing costs, which have to be minimized. We discuss a greedy online algorithm that routes each commodity by minimizing a convex cost function that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2011
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-011-9409-z